Misleading Generalized Itemset discovery
نویسندگان
چکیده
Frequent generalized itemset mining is a data mining technique utilized to discover a high-level view of interesting knowledge hidden in the analyzed data. By exploiting a taxonomy, patterns are usually extracted at any level of abstraction. However, some misleading high-level patterns could be included in the mined set. This paper proposes a novel generalized itemset type, namely theMisleading Generalized Itemset (MGI). Each MGI, denoted as X ⊲ E , represents a frequent generalized itemset X and its set E of low-level frequent descendants for which the correlation type is in contrast to the one of X. To allow experts to analyze the misleading high-level data correlations separately and exploit such knowledge by making different decisions, MGIs are extracted only if the low-level descendant itemsets that represent contrasting correlations cover almost the same portion of data as the high-level (misleading) ancestor. An algorithm to mine MGIs at the top of traditional generalized itemsets is also proposed. ∗Corresponding author. Tel.: +39 011 090 7084. Fax: +39 011 090 7099. Email addresses: [email protected] (Luca Cagliero), [email protected] (Tania Cerquitelli), [email protected] (Paolo Garza), [email protected] (Luigi Grimaudo) Preprint submitted to The experiments performed on both real and synthetic datasets demonstrate the effectiveness and efficiency of the proposed approach.
منابع مشابه
Fast Algorithms for Mining Generalized Frequent Patterns of Generalized Association Rules
Mining generalized frequent patterns of generalized association rules is an important process in knowledge discovery system. In this paper, we propose a new approach for efficiently mining all frequent patterns using a novel set enumeration algorithm with two types of constraints on two generalized itemset relationships, called subset-superset and ancestor-descendant constraints. We also show a...
متن کاملAMKIS: An Algorithm for Association Mining
Mining frequent items and itemsets is a daunting task in large databases and has attracted research attention in recent years. Generating specific itemset, K –itemset having K items, is an interesting research problem in data mining and knowledge discovery. In this paper, we propose an algorithm for finding K itemset frequent pattern generation in large databases which is named as AMKIS. AMKIS ...
متن کاملA Survey on Moving Towards Frequent Pattern Growth for Infrequent Weighted Itemset Mining
Data Mining and knowledge discovery is one of the important areas. In this paper we are presenting a survey on various methods for frequent pattern mining. From the past decade, frequent pattern mining plays a very important role but it does not consider the weight factor or value of the items. The very first and basic technique to find the correlation of data is Association Rule Mining. In ARM...
متن کاملA survey of itemset mining
Itemset mining is an important subfield of data mining, which consists of discovering interesting and useful patterns in transaction databases. The traditional task of frequent itemset mining is to discover groups of items (itemsets) that appear frequently together in transactions made by customers. Although itemset mining was designed for market basket analysis, it can be viewed more generally...
متن کاملMaintenance of Generalized Association Rules Based on Pre-large Concepts
Due to the increasing use of very large databases and data warehouses, mining useful information and helpful knowledge from transactions is evolving into an important research area. In the past, researchers usually assumed databases were static and items were on a single level to simplify data mining problems. Thus, most of algorithms proposed focused on a single level, and did not utilize prev...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Expert Syst. Appl.
دوره 41 شماره
صفحات -
تاریخ انتشار 2014